Stabilizing BinomialnEstimators

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

“Stabilizing” the stabilizing controllers

The main purpose of this paper is to revisit the internal/simultaneous/robust stabilization problems without assuming the existence of doubly coprime factorizations for the transfer matrices. Indeed, it has been recently shown in the literature that an internally stabilizable does not generally admit doubly coprime factorizations. Firstly, we give new necessary and sufficient conditions for int...

متن کامل

Stabilizing bisets

Let G be a finite group and let R be a commutative ring. We analyse the (G,G)-bisets which stabilize an indecomposable RG-module. We prove that the minimal ones are unique up to equivalence. This result has the same flavor as the uniqueness of vertices and sources up to conjugation and resembles also the theory of cuspidal characters in the context of Harish-Chandra induction for reductive grou...

متن کامل

Stabilizing brokerage.

A variety of social and economic arrangements exist to facilitate the exchange of goods, services, and information over gaps in social structure. Each of these arrangements bears some relationship to the idea of brokerage, but this brokerage is rarely like the pure and formal economic intermediation seen in some modern markets. Indeed, for reasons illuminated by existing sociological and econom...

متن کامل

Stabilizing Unison

The guard of an action in program P.i is a Boolean expression over the x variables and the local variables of P.i. The assignment statement of an action in P.i updates variable x.i and the local variables of P. i. A state of this system is defined by a value for every x.i and a value for every local variable in each program. An action whose guard is true at some state is said to be enabled at t...

متن کامل

Self-stabilizing Deterministic Gathering

In this paper, we investigate the possibility to deterministically solve the gathering problem (GP) with weak robots (anonymous, autonomous, disoriented, deaf and dumb, and oblivious). We introduce strong multiplicity detection as the ability for the robots to detect the exact number of robots located at a given position. We show that with strong multiplicity detection, there exists a determini...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 1986

ISSN: 0162-1459,1537-274X

DOI: 10.1080/01621459.1986.10478255